Optimization Problems and Algorithms in Double-layered Food Packing Systems

Biological Application of Layered Double Hydroxides in Drug Delivery Systems

This review focuses on the extensive study of different layered double hydroxides (LDHs)nanostructures and also their biological and physicochemical (in vitro) properties to encapsulateand deliver drugs with a recognized pharmacokinetic profile in a sustained/modified manner forbetter remedial efficacy contrasted to the corresponding conventional treatments using different<br ...

PROJECTED DYNAMICAL SYSTEMS AND OPTIMIZATION PROBLEMS

We establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. A corresponding novel neural network model, which is globally convergent and stable in the sense of Lyapunov, is proposed. Both theoretical and numerical approaches are considered. Numerical simulations for three constrained nonlinear optimization problems a...

Combinatorial algorithms for packing and scheduling problems

Optimal Online Algorithms for Multidimensional Packing Problems

We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing that uses only bounded space. To achieve this, we introduce a new technique for classifying the items to be packed. We show that our algorithm is optimal among bounded space algorithms for any dimension d > 1. Its asymptotic performance ratio is (Π∞) , where Π∞ ≈ 1.691 is the asymptotic ...

Parameterized approximation algorithms for packing problems

In the past decade, many parameterized algorithms were developed for packing problems. Our goal is to obtain tradeoffs that improve the running times of these algorithms at the cost of computing approximate solutions. Consider a packing problem for which there is no known algorithm with approximation ratio α, and a parameter k. If the value of an optimal solution is at least k, we seek a soluti...